Using quantum computing to solve the maximal covering location problem
نویسندگان
چکیده
Abstract In this article, we present the process and results of using quantum computing (QC) to solve maximal covering location problem proposed by Church ReVelle. With contribution, seek lay foundations for other urban regional scientists begin consider technologies. We obtained promising results, but it is clear that there a need more capable devices with qubits less susceptibility electronic noise instances currently cannot be optimally solved traditional solvers. foresee QC will common use in science its applications years come.
منابع مشابه
Efficient Solution Procedure to Develop Maximal Covering Location Problem Under Uncertainty (Using GA and Simulation)
In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical mod...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملefficient solution procedure to develop maximal covering location problem under uncertainty (using ga and simulation)
in this paper, we present the stochastic version of maximal covering location problem which optimizes both location and allocation decisions, concurrently. it’s assumed that traveling time between customers and distribution centers (dcs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to dc. in classical model...
متن کاملHybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering locationallocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This pa...
متن کاملA Constructive Genetic Algorithm for the Maximal Covering Location Problem
The Constructive Genetic Algorithm (CGA) was proposed by Lorena and Furtado [6], as an alternative to the traditional GAs approach. Particularly the CGA directly evaluates schemata, works with a dynamic population size, performs mutation in complete structures, and uses heuristics in schemata and/or structure representation. The schemata are evaluated and can be added to the population if they ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Urban Science
سال: 2022
ISSN: ['2730-6852']
DOI: https://doi.org/10.1007/s43762-022-00070-x